optimal pursuit - translation to ρωσικά
Diclib.com
Λεξικό ChatGPT
Εισάγετε μια λέξη ή φράση σε οποιαδήποτε γλώσσα 👆
Γλώσσα:

Μετάφραση και ανάλυση λέξεων από την τεχνητή νοημοσύνη ChatGPT

Σε αυτήν τη σελίδα μπορείτε να λάβετε μια λεπτομερή ανάλυση μιας λέξης ή μιας φράσης, η οποία δημιουργήθηκε χρησιμοποιώντας το ChatGPT, την καλύτερη τεχνολογία τεχνητής νοημοσύνης μέχρι σήμερα:

  • πώς χρησιμοποιείται η λέξη
  • συχνότητα χρήσης
  • χρησιμοποιείται πιο συχνά στον προφορικό ή γραπτό λόγο
  • επιλογές μετάφρασης λέξεων
  • παραδείγματα χρήσης (πολλές φράσεις με μετάφραση)
  • ετυμολογία

optimal pursuit - translation to ρωσικά

CLASS OF MATHEMATICAL PROBLEMS CONCERNED WITH CHOOSING AN OPTIMAL TIME TO TAKE A PARTICULAR ACTION
Optimal Stopping; Optimal Stopping problem

optimal pursuit      

математика

оптимальное преследование

curve of pursuit         
  • [[Pierre Bouguer]]'s 1732 article studying pursuit curves
  • Curve of pursuit of vertices of a [[square]] (the [[mice problem]] for ''n''=4).
  • Curves of pursuit with different parameters
CURVE TRACED BY A PURSUER CHASING A PURSUEE
Curve of pursuit; Pursuit Curve

теория игр

кривая погони

optimal stopping problem         
задача об оптимальной остановке

Ορισμός

fresh pursuit
n. immediate chase of a suspected criminal by a law enforcement officer, in which situation the officer may arrest the suspect without a warrant. It can also refer to chasing a suspect or escaped felon into a neighboring jurisdiction in an emergency, as distinguished from entering another jurisdiction with time to alert law enforcement people in that area. Example: when a deputy sheriff from Montgomery County pursues a car driven by a suspected bank robber into Baltimore County (in which he normally has no power to enforce the law), the doctrine of fresh pursuit allows him/her to make the arrest. It is also called hot pursuit. See also: hot pursuit

Βικιπαίδεια

Optimal stopping

In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance (related to the pricing of American options). A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming.

Μετάφραση του &#39optimal pursuit&#39 σε Ρωσικά